public class 和至少为K的最短子数组 {

    public static int MAXN = 10001;
    public static int[] deque = new int[MAXN];
    public static int h,t;
    public int shortestSubarray(int[] nums, int k) {
        h = t = 0;
        
    }
}
